Dictionary Learning and Non-Asymptotic Bounds for Geometric Multi-Resolution Analysis
نویسندگان
چکیده
منابع مشابه
Multiscale Dictionary Learning: Non-Asymptotic Bounds and Robustness
High-dimensional datasets are well-approximated by low-dimensional structures. Over the past decade, this empirical observation motivated the investigation of detection, measurement, and modeling techniques to exploit these low-dimensional intrinsic structures, yielding numerous implications for high-dimensional statistics, machine learning, and signal processing. Manifold learning (where the l...
متن کاملNoise Level Estimation for Overcomplete Dictionary Learning Based on Tight Asymptotic Bounds
In this letter, we address the problem of estimating Gaussian noise level from the trained dictionaries in update stage. We first provide rigorous statistical analysis on the eigenvalue distributions of a sample covariance matrix. Then we propose an interval-bounded estimator for noise variance in high dimensional setting. To this end, an effective estimation method for noise level is devised b...
متن کاملImage Super-Resolution Reconstruction Based On Multi-Dictionary Learning
In order to overcome the problems that the single dictionary cannot be adapted to variety types of images and the reconstruction quality couldn’t meet the application, we propose a novel Multi-Dictionary Learning algorithm for feature classification. The algorithm uses the orientation information of the low resolution image to guide the image patches in the database to classify, and designs the...
متن کاملNon Asymptotic Bounds for Vector Quantization
Recent results in quantization theory show that the convergence rate for the mean-squared expected distortion of the empirical risk minimizer strategy, for any fixed probability distribution satisfying some regularity conditions is O(1/n), where n is the sample size (see, e.g., [6] or [11]). However, the dependency of the average distortion on other parameters is not known. This paper offers mo...
متن کاملNon-asymptotic Calibration and Resolution
We analyze a new algorithm for probability forecasting of binary observations on the basis of the available data, without making any assumptions about the way the observations are generated. The algorithm is shown to be well calibrated and to have good resolution for long enough sequences of observations and for a suitable choice of its parameter, a kernel on the Cartesian product of the foreca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2014
ISSN: 1617-7061
DOI: 10.1002/pamm.201410486